Explicit Construction of AG Codes from Generalized Hermitian Curves
نویسنده
چکیده
We present multi-point algebraic geometric codes overstepping the Gilbert-Varshamov bound. The construction is based on the generalized Hermitian curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These codes are described in detail by constrcting a generator matrix. It turns out that these codes have nice properties similar to those of Hermitian codes. It is shown that the duals are also such codes and an explicit formula is given. Index Terms Hermitian codes, algebraic geometric codes, asymptotically good tower, Gilbert-Varshamov bound.
منابع مشابه
Generalized Bezout's theorem and its applications in coding theory
This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two or more plane curves. A new approach to determine a lower bound on the minimum distance for algebraic-geometric codes defined from a class of plane curves is introduced, based on the generalized Bezout theorem. Examples of more efficient l...
متن کاملLocally Recoverable Codes with Availability t≥2 from Fiber Products of Curves
We generalize the construction of locally recoverable codes on algebraic curves given by Barg, Tamo and Vlăduţ [4] to those with arbitrarily many recovery sets by exploiting the structure of fiber products of curves. Employing maximal curves, we create several new families of locally recoverable codes with multiple recovery sets, including codes with two recovery sets from the generalized Giuli...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملA low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Since the proof in 1982, by Tsfasman Vlăduţ and Zink of the existence of algebraic-geometric (AG) codes with asymptotic performance exceeding the Gilbert–Varshamov (G–V) bound, one of the challenges in coding theory has been to provide explicit constructions for these codes. In a major step forward during 1995–1996, Garcia and Stichtenoth (G–S) provided an explicit description of algebraic curv...
متن کاملList Decoding Algorithm based on Voting in Gröbner Bases for General One-Point AG Codes
We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós, and O’Sullivan [31] to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.03418 شماره
صفحات -
تاریخ انتشار 2015